Перевод: с английского на русский

с русского на английский

infinite branch

См. также в других словарях:

  • Infinite divisibility — The concept of infinite divisibility arises in different ways in philosophy, physics, economics, order theory (a branch of mathematics), and probability theory (also a branch of mathematics). One may speak of infinite divisibility, or the lack… …   Wikipedia

  • Infinite-dimensional holomorphy — In mathematics, infinite dimensional holomorphy is a branch of functional analysis. It is concerned with generalizations of the concept of holomorphic function to functions defined and taking values in complex Banach spaces (or Fréchet spaces… …   Wikipedia

  • James Branch Cabell — Infobox Writer name = James Branch Cabell caption = James Branch Cabell photographed by Carl Van Vechten, 1935. birthdate = April 14, 1879 birthplace = Richmond, Virginia deathdate = May 5, 1958 deathplace = life = occupation = Author movement =… …   Wikipedia

  • Honest leftmost branch — In graph theory, a honest leftmost branch of a tree T on omega; times; gamma; is a branch f isin; [ T ] such that for each branch g isin; [ T ] , one has forall; n isin; omega; : f ( n ) le; g ( n ). (Here, [ T ] denotes the set of branches of… …   Wikipedia

  • Unbounded nondeterminism — In computer science, unbounded nondeterminism or unbounded indeterminacy is a property of concurrency by which the amount of delay in servicing a request can become unbounded as a result of arbitration of contention for shared resources while… …   Wikipedia

  • Tree (set theory) — In set theory, a tree is a partially ordered set (poset) ( T …   Wikipedia

  • SLD resolution — ( Selective Linear Definite clause resolution) is the basic inference rule used in logic programming. It is a refinement of resolution, which is both sound and refutation complete for Horn clauses. The SLD inference ruleGiven a goal clause: eg L… …   Wikipedia

  • König's lemma — or König s infinity lemma is a theorem in graph theory due to Dénes Kőnig (1936). It gives a sufficient condition for an infinite graph to have an infinitely long path. The computability aspects of this theorem have been thoroughly investigated… …   Wikipedia

  • Triaenops Persicus — Trident Tri dent (tr[imac] dent), n. [L. tridens, entis; tri (see {Tri }) + dens tooth: cf. F. trident. See {Tooth}.] 1. (Class Myth.) A kind of scepter or spear with three prongs, the common attribute of Neptune. [1913 Webster] 2. (Rom. Antiq.)… …   The Collaborative International Dictionary of English

  • Trident — Tri dent (tr[imac] dent), n. [L. tridens, entis; tri (see {Tri }) + dens tooth: cf. F. trident. See {Tooth}.] 1. (Class Myth.) A kind of scepter or spear with three prongs, the common attribute of Neptune. [1913 Webster] 2. (Rom. Antiq.) A three… …   The Collaborative International Dictionary of English

  • Trident bat — Trident Tri dent (tr[imac] dent), n. [L. tridens, entis; tri (see {Tri }) + dens tooth: cf. F. trident. See {Tooth}.] 1. (Class Myth.) A kind of scepter or spear with three prongs, the common attribute of Neptune. [1913 Webster] 2. (Rom. Antiq.)… …   The Collaborative International Dictionary of English

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»